Cheeger-Type Approximation for Sparsest st -Cut
نویسندگان
چکیده
منابع مشابه
Is Cheeger-type Approximation Possible for Nonuniform Sparsest Cut?
In the nonuniform sparsest cut problem, given two undirected graphs G and H over the same set of vertices V , we want to find a cut (S, V − S) that minimizes the ratio between the fraction of G-edges that are cut and the fraction of H-edges that are cut. The ratio (which is at most 1 in an optimal solution) is called the sparsity of the cut. The special case in which H is a clique over V is cal...
متن کاملLecture 03 : The Sparsest Cut Problem and Cheeger ’ s Inequality
In a social network graph, a person is regarded as a vertex, and if person u and person v know each other, then vertex u and vertex v forms an edge (u, v). Intuitively a community is thought as a set S of people which has the following two properties: (1) people in S are likely know each other, and (2) people out of set S (we call this set S̄) are less likely to know each other. So communities a...
متن کاملn)-Approximation Algorithm For Directed Sparsest Cut
We give an O( √ n)-approximation algorithm for the Sparsest Cut Problem on directed graphs. A näıve reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of O( √ n log D), where D is the sum of the demands. We obtain the improvement using a novel LP-rounding method for fractional Sparsest Cut, the dual of Maximum Concurrent Flow.
متن کاملSparsest Cut
An approximation algorithm is an efficient algorithm that finds an approximate solution with a provable approximation guarantee. The standard measure of the quality of an approximation algorithm is its approximation factor. The approximation factor of an algorithm is the worst case ratio between the value (cost) of the solution the algorithm finds and the value (cost) of the optimal solution. T...
متن کاملLecture 17 : Cheeger ’ s Inequality and the Sparsest Cut Problem 17 - 3
In the rest of this course we use the proof of Marcus, Spielman and Srivastava to prove an upper bound of polyloglog(n) on the integrality gap of the Held-Karp relaxation for ATSP. The materials will be based on the work of Oveis Gharan and Anari [AO14]. We start by introducing the sparsest cut problem and Cheeger’s inequalities. The ideas that we develop here will be crucially used later. In p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2996799